Perpetually Dominating Large Grids
نویسندگان
چکیده
In the Eternal Domination game, a team of guard tokens initially occupies a dominating set on a graph G. A rioter then picks a node without a guard on it and attacks it. The guards defend against the attack: one of them has to move to the attacked node, while each remaining one can choose to move to one of his neighboring nodes. The new guards’ placement must again be dominating. This attack-defend procedure continues perpetually. The guards win if they can eternally maintain a dominating set against any sequence of attacks, otherwise the rioter wins. We study rectangular grids and provide the first known general upper bound for these graphs. Our novel strategy implements a square rotation principle and eternally dominates m× n grids with the guards’ number converging to 20% of the nodes as m,n grow.
منابع مشابه
Performance models for desktop grids
Main characteristics of desktop grids are the large number of nodes and their heterogeneity. Application speedup on a large-scale desktop grid is limited by the heterogeneous computational capabilities of each node, which increase the synchronization overhead, and by the large number of nodes, that results in the serial fraction dominating performance. In this paper we present an innovative tec...
متن کاملOn (t, r) broadcast domination numbers of grids
The domination number of a graph G = (V,E) is the minimum cardinality of any subset S ⊂ V such that every vertex in V is in S or adjacent to an element of S. Finding the domination numbers of m by n grids was an open problem for nearly 30 years and was finally solved in 2011 by Goncalves, Pinlou, Rao, and Thomassé. Many variants of domination number on graphs, such as double domination number a...
متن کاملIndependent [1, 2]-domination of grids via min-plus algebra
Domination of grids has been proved to be a demanding task and with the addition of independence it becomes more challenging. It is known that no grid withm,n ≥ 5 has a perfect code, that is an independent vertex set such that each vertex not in it has exactly one neighbor in that set. So it is interesting to study the existence of an independent dominating set for grids that allows at most two...
متن کاملEternal domination on 3 × n grid graphs
In the eternal dominating set problem, guards form a dominating set on a graph and at each step, a vertex is attacked. After each attack, if the guards can “move” to form a dominating set that contains the attacked vertex, then the guards have successfully defended against the attack. We wish to determine the minimum number of guards required to successfully defend against any possible sequence...
متن کامل